Random rigidity in the free group
نویسندگان
چکیده
منابع مشابه
Rigidity of pseudo-free group actions on contractible manifolds
In this article, we announce joint work with Frank Connolly and Jim Davis [6]. This follows an earlier case study of pseudo-free involutions on the n-torus carried out in [5]. The author is grateful to the organizers of the RIMS conferences where these results were disseminated in Asia: Transformation Groups and Surgery Theory (Masayuki Yamasaki, August 2010), Transformation Groups and Combinat...
متن کاملRigidity Phenomena in the Mapping Class Group
Throughout this article we will consider connected orientable surfaces of negative Euler characteristic and of finite topological type, meaning of finite genus and with finitely many boundary components and/or cusps. We will feel free to think about cusps as marked points, punctures or topological ends. Sometimes we will need to make explicit mention of the genus and number of punctures of a su...
متن کاملNucleation-free 3D rigidity
All known examples of generic 3D bar-and-joint frameworks where the distance between a non-edge pair is implied by the edges in the graph contain a rigid vertexinduced subgraph. In this paper we present a class of arbitrarily large graphs with no non-trivial vertex-induced rigid subgraphs, which have implied distances between pairs of vertices not joined by edges. As a consequence, we obtain (a...
متن کاملdetermination of maximal singularity free zones in the workspace of parallel manipulator
due to the limiting workspace of parallel manipulator and regarding to finding the trajectory planning of singularity free at workspace is difficult, so finding a best solution that can develop a technique to determine the singularity-free zones in the workspace of parallel manipulators is highly important. in this thesis a simple and new technique are presented to determine the maximal singula...
15 صفحه اولOn the Rigidity of Sparse Random Graphs
A graph with a trivial automorphism group is said to be rigid. Wright proved [11] that for logn n + ω( 1 n) ≤ p ≤ 1 2 a random graph G ∈ G(n, p) is rigid whp. It is not hard to see that this lower bound is sharp and for p < (1− ) logn n with positive probability aut(G) is nontrivial. We show that in the sparser case ω( 1 n) ≤ p ≤ logn n + ω( 1 n), it holds whp that G’s 2-core is rigid. We concl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geometry & Topology
سال: 2013
ISSN: 1364-0380,1465-3060
DOI: 10.2140/gt.2013.17.1707